Non-rigid image registration through efficient discrete optimization
نویسندگان
چکیده
Discrete optimization offers attractive capabilities for non-rigid medical image registration. Based on previous work on stereo vision with large displacement spaces, we propose a novel non-rigid registration method. The main idea to minimize the computational burden to constant time complexity is to reduce the search space hierarchically from coarse to fine levels. The large search space helps us to avoid local minima in the optimization scheme. We apply our method to a number of challenging registration tasks. Our approach compares very favourably against state-of-the-art registration methods.
منابع مشابه
بهبود سرعت "انطباق مبتنی بر روش برش گراف" جهت انطباق غیر صلب تصاویر تشدید مغناطیسی مغز
Image processing methods, which can visualize objects inside the human body, are of special interests. In clinical diagnosis using medical images, integration of useful data from separate images is often desired. The images have to be geometrically aligned for better observation. The procedure of mapping points from the reference image to corresponding points in the floating image is called Ima...
متن کاملNon-rigid Registration using Discrete MRFs: Application to Thoracic CT Images
We recently introduced labeling of discrete Markov random fields (MRFs) as an attractive approach for non-rigid image registration. Our MRF framework makes use of recent advances in discrete optimization, is efficient in terms of computation time, and provides great flexibility. Any similarity measure can be encoded right away, since no differentiation is needed. In this work, we investigate th...
متن کاملEfficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search
Rigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solut...
متن کاملNon-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local min...
متن کاملNon-rigid Image Registration with Uniform Spherical Structure Patterns
Non-rigid image registration is a challenging task in medical image analysis. In recent years, there are two essential issues. First, intensity similarity is not necessarily equivalent to anatomical similarity when the anatomical correspondences between subject and template images are established. Second, the registration algorithm should be robust against monotonic gray-level transformation wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011